Signature of time-reversal symmetry in polynomial automorphisms over finite fields
نویسندگان
چکیده
We investigate the reduction to finite fields of polynomial automorphisms of the plane, which lead to invertible dynamics (permutations) of a finite space. We provide evidence that, if the map of the plane is non-integrable, then the presence or absence of a type of time-reversal symmetry called R-reversibility produces a clear signature in the cycle statistics of the associated permutation. If there is such a time-reversal symmetry, the cycle statistics is conjectured to obey a universal distribution, whereas if no such time-reversal symmetry is present, the cycle statistics is consistent with that of a random permutation. These results furnish necessary conditions forR-reversibility to exist in rational maps of the plane, which can be checked via finite computation in a finite field. This translates into effective tests for the existence of R-reversibility, and a probabilistic algorithm for determining parameter values at which a map has such a property. Mathematics Subject Classification: 37E30, 37C80, 11T99
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملOrder and symmetry in birational difference equations and their signatures over finite phase spaces
We consider two classes of birational maps, or birational difference equations, that have structural properties defined by algebraic relations. The properties are possession of a rational integral and having a discrete time-reversal symmetry. We then consider how these algebraic structures constrain the distribution of orbit lengths of such maps when they are reduced over finite fields, giving ...
متن کاملReversals and Transpositions over Finite Alphabets
Extending results of Christie and Irving, we examine the action of reversals and transpositions on finite strings over an alphabet of size k. We show that determining reversal, transposition or signed reversal distance between two strings over a finite alphabet is NP-hard, while for ‘dense’ instances we give a polynomial-time approximation scheme. We also give a number of extremal results, as w...
متن کاملFactoring Polynomials over Finite Fields using Balance Test
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time algorithm that fails to factor only if the input polynomial satisfies a strong symmetry property, namely square balance. In this paper, we propose an extension of Gao’s algorithm that fails only under an even stronger ...
متن کاملA combinatorial model for reversible rational maps over finite fields
We study time-reversal symmetry in dynamical systems with finite phase space, with applications to birational maps reduced over finite fields. For a polynomial automorphism with a single family of reversing symmetries, a universal (i.e. map-independent) distribution function R(x) = 1 − e−x(1 + x) has been conjectured to exist, for the normalized cycle lengths of the reduced map in the large fie...
متن کامل